Product Form Steady-State Distribution for Stochastic Automata Networks with Domino Synchronizations

نویسنده

  • Jean-Michel Fourneau
چکیده

• The main idea is to obtain a generalized tensor description of the transition probability matrix or the transition rate matrix • N finite automata. One automaton is used to model one component. • The state space is included into the Cartesian product of the state space of the automata.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Longest Path in Networks of Queues in the Steady-State

Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...

متن کامل

Parametric Analysis of Stochastic

We investigate some graph properties which may simplify the computation of the steady-state distribution of Markov chain. We consider the directed graph associated to a Markov chain derived from Stochastic Automata Network and we give an algorithm to solve the Kolmogorov equations for the steady-state distribution. Then, we present an extension of this algorithm which allows the parametric anal...

متن کامل

Graphs and Stochastic Automata Networks 1

We show how some graph theoretical arguments may be used to reduce the complexity of the computation of the steady-state distribution of Markov chain. We consider the directed graph associated to a Markov chain derived from a Stochastic Automata Network (SAN). The structural properties of the automata are used to establish new various results. First, we establish the complexity of the resolutio...

متن کامل

RCAT: From PEPA to Product form

Whereas product forms such as Jackson’s theorem operate over queueing networks, RCAT operates over the stochastic process algebra components defined in PEPA [3]. In the same way that Jackson’s theorem relates the global steadystate probability to the steady-state distributions of the constituent queueing nodes, so RCAT relates the steady state distribution of the global state space of the PEPA ...

متن کامل

Unbounded Product-Form Petri Nets

Computing steady-state distributions in infinite-state stochastic systems is in general a very difficult task. Product-form Petri nets are those Petri nets for which the steady-state distribution can be described as a natural product corresponding, up to a normalising constant, to an exponentiation of the markings. However, even though some classes of nets are known to have a product-form distr...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008